WEAK EQUIVALENCE OF STATIONARY ACTIONS AND THE ENTROPY REALIZATION PROBLEM PETER BURTON, MARTINO LUPINI, AND OMER TAMUZ Abstract. We initiate the study of weak containment and weak equivalence for µ-stationary actions f

Source URL: people.hss.caltech.edu

• Mathematical analysis
• Mathematics
• Measure theory
• Stochastic processes
• Compactification
• Harmonic analysis
• Poisson boundary
• Equivalence relation
• Equivalence of categories
• Von Neumann algebra
• Amenable group
• Equivalence

Relation algebras as expanded FL-algebras Nikolaos Galatos and Peter Jipsen University of Denver and Chapman University

Source URL: spot.colorado.edu

• Mathematics
• Algebra
• Abstract algebra
• Algebraic logic
• Mathematical logic
• Fuzzy logic
• Boolean algebra
• Algebraic structures
• Residuated lattice
• Relation algebra
• Variety
• Binary relation

Possible and Certain Answers for Queries over Order-Incomplete Data Antoine Amarilli1 , Mouhamadou Lamine Ba2 , Daniel Deutch3 , and Pierre Senellart1,4 1 2

Source URL: pierre.senellart.com

• Mathematics
• Mathematical logic
• Logic
• Relational model
• Data management
• Type theory
• Order theory
• Relational algebra
• FO
• Tuple
• Relation
• Data integration

Characterizing algebras and varieties by weak congruence lattices and open problems ˇ selja Andreja Tepavˇcevi´c and Branimir Seˇ Department of Mathematics and Informatics, Faculty of Sciences

Source URL: spot.colorado.edu

• Lie groups
• Algebra
• Lattice theory
• Congruence relation
• Modular arithmetic
• Compact element
• Quotient algebra
• Congruence
• Lattice
• Congruence lattice problem
• Distributive homomorphism

Chu Spaces Vaughan Pratt Stanford University Notes for the School on Category Theory and Applications University of Coimbra

Source URL: chu.stanford.edu

• Algebraic structures
• Chu space
• Semilattice
• Boolean algebra
• Structure
• Homomorphism
• Partially ordered set
• Lattice
• Adjoint functors
• Binary relation
• Isomorphism
• Dual space

Computer discovery and analysis of large Poisson polynomials David H. Bailey∗ Jonathan M. Borwein† Jason S. Kimberley‡

Source URL: www.davidhbailey.com

• Polynomials
• Mathematics
• Algebra
• Integer relation algorithm
• Factorization of polynomials
• Polynomial
• Factorization
• Minimal polynomial
• Experimental mathematics
• Polynomial greatest common divisor

Definability of Combinatorial Functions and Their Linear Recurrence Relations Extended Abstract T. Kotek ⋆

Source URL: www.cs.technion.ac.il

• Mathematics
• Algebra
• Abstract algebra
• Recurrence relation
• Theory of computation
• Rational function
• Generating function
• Factorial
• Exponentiation
• Polynomial
• KochenSpecker theorem

Representation of Partial Traces Marc Bagnol Department of Mathematics and Statistics – University of Ottawa The notion of trace in a monoidal category has been introduced by Joyal Street and Verity [4] to give a categ

Source URL: logica.dmi.unisa.it

• Linear algebra
• Monoidal categories
• Order theory
• Category theory
• Abstract algebra
• Partial trace
• Andr Joyal
• Trace
• Equivalence class
• Equivalence relation
• Embedding
• Natural transformation

On the relation between Concurrent Separation Logic and Concurrent Kleene Algebra

Source URL: www.doc.ic.ac.uk

RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati

Source URL: www.marc.mezzarobba.net

• Algebra
• Orthogonal polynomials
• Elementary algebra
• Numerical analysis
• Approximation theory
• Chebyshev polynomials
• Polynomial
• Recurrence relation
• Holonomic function
• Minimax approximation algorithm
• Rational function
• Factorization